Accounting for the tongue-and-groove effect using a robust direct aperture optimization approach

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/98733/1/MPH001266.pd

4,4′-Bipyridine–2,3,4,5,6-penta­fluoro­benzoic acid (1/2)

In the title 1:2 adduct, C10H8N2·2C7HF5O2, the complete 4,4′-bipyridine mol­ecule is generated by a crystallographic twofold axis. The components of the adduct are linked by inter­molecular O—H⋯N hydrogen bonds and further connected by a combination of C—H⋯O, C—H⋯F and F⋯F [2.859 (2) Å] inter­actions

1,10-Phenanthrolinium 2,3,4,5,6-penta­fluoro­benzoate–2,3,4,5,6-penta­fluoro­benzoic acid (1/2)

In the title compound, C12H9N2 +·C7F5O2 −·2C7HF5O2, the cation and anion are linked by an N—H⋯O hydrogen bond. The neutral mol­ecules bond to the anion via O—H⋯O hydrogen bonds to form associations of one cation, one anion and two neutral mol­ecules. Inter­molecular C—H⋯O, C—H⋯F, F⋯F [shortest contact = 2.768 (8) Å], F⋯π [shortest contact = 3.148 (13) Å] and π–π [shortest centroid–centroid separation = 3.689 (5) Å] inter­actions further link the components to form a three-dimensional network

Ultrafast treatment plan optimization for volumetric modulated arc therapy (VMAT)

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/134981/1/mp1675.pd

Beam Orientation Optimization for Intensity Modulated Radiation Therapy using Adaptive l1 Minimization

Beam orientation optimization (BOO) is a key component in the process of IMRT treatment planning. It determines to what degree one can achieve a good treatment plan quality in the subsequent plan optimization process. In this paper, we have developed a BOO algorithm via adaptive l_1 minimization. Specifically, we introduce a sparsity energy function term into our model which contains weighting factors for each beam angle adaptively adjusted during the optimization process. Such an energy term favors small number of beam angles. By optimizing a total energy function containing a dosimetric term and the sparsity term, we are able to identify the unimportant beam angles and gradually remove them without largely sacrificing the dosimetric objective. In one typical prostate case, the convergence property of our algorithm, as well as the how the beam angles are selected during the optimization process, is demonstrated. Fluence map optimization (FMO) is then performed based on the optimized beam angles. The resulted plan quality is presented and found to be better than that obtained from unoptimized (equiangular) beam orientations. We have further systematically validated our algorithm in the contexts of 5-9 coplanar beams for 5 prostate cases and 1 head and neck case. For each case, the final FMO objective function value is used to compare the optimized beam orientations and the equiangular ones. It is found that, our BOO algorithm can lead to beam configurations which attain lower FMO objective function values than corresponding equiangular cases, indicating the effectiveness of our BOO algorithm.Comment: 19 pages, 2 tables, and 5 figure

GPU-based ultra-fast direct aperture optimization for online adaptive radiation therapy

Online adaptive radiation therapy (ART) has great promise to significantly reduce normal tissue toxicity and/or improve tumor control through real-time treatment adaptations based on the current patient anatomy. However, the major technical obstacle for clinical realization of online ART, namely the inability to achieve real-time efficiency in treatment re-planning, has yet to be solved. To overcome this challenge, this paper presents our work on the implementation of an intensity modulated radiation therapy (IMRT) direct aperture optimization (DAO) algorithm on graphics processing unit (GPU) based on our previous work on CPU. We formulate the DAO problem as a large-scale convex programming problem, and use an exact method called column generation approach to deal with its extremely large dimensionality on GPU. Five 9-field prostate and five 5-field head-and-neck IMRT clinical cases with 5\times5 mm2 beamlet size and 2.5\times2.5\times2.5 mm3 voxel size were used to evaluate our algorithm on GPU. It takes only 0.7~2.5 seconds for our implementation to generate optimal treatment plans using 50 MLC apertures on an NVIDIA Tesla C1060 GPU card. Our work has therefore solved a major problem in developing ultra-fast (re-)planning technologies for online ART

GPU-based Fast Low-dose Cone Beam CT Reconstruction via Total Variation

Cone-beam CT (CBCT) has been widely used in image guided radiation therapy (IGRT) to acquire updated volumetric anatomical information before treatment fractions for accurate patient alignment purpose. However, the excessive x-ray imaging dose from serial CBCT scans raises a clinical concern in most IGRT procedures. The excessive imaging dose can be effectively reduced by reducing the number of x-ray projections and/or lowering mAs levels in a CBCT scan. The goal of this work is to develop a fast GPU-based algorithm to reconstruct high quality CBCT images from undersampled and noisy projection data so as to lower the imaging dose. The CBCT is reconstructed by minimizing an energy functional consisting of a data fidelity term and a total variation regularization term. We developed a GPU-friendly version of the forward-backward splitting algorithm to solve this model. A multi-grid technique is also employed. We test our CBCT reconstruction algorithm on a digital NCAT phantom and a head-and-neck patient case. The performance under low mAs is also validated using a physical Catphan phantom and a head-and-neck Rando phantom. It is found that 40 x-ray projections are sufficient to reconstruct CBCT images with satisfactory quality for IGRT patient alignment purpose. Phantom experiments indicated that CBCT images can be successfully reconstructed with our algorithm under as low as 0.1 mAs/projection level. Comparing with currently widely used full-fan head-and-neck scanning protocol of about 360 projections with 0.4 mAs/projection, it is estimated that an overall 36 times dose reduction has been achieved with our algorithm. Moreover, the reconstruction time is about 130 sec on an NVIDIA Tesla C1060 GPU card, which is estimated ~100 times faster than similar iterative reconstruction approaches.Comment: 20 pages, 10 figures, Paper was revised and more testing cases were added

Real-time volumetric image reconstruction and 3D tumor localization based on a single x-ray projection image for lung cancer radiotherapy

Purpose: To develop an algorithm for real-time volumetric image reconstruction and 3D tumor localization based on a single x-ray projection image for lung cancer radiotherapy. Methods: Given a set of volumetric images of a patient at N breathing phases as the training data, we perform deformable image registration between a reference phase and the other N-1 phases, resulting in N-1 deformation vector fields (DVFs). These DVFs can be represented efficiently by a few eigenvectors and coefficients obtained from principal component analysis (PCA). By varying the PCA coefficients, we can generate new DVFs, which, when applied on the reference image, lead to new volumetric images. We then can reconstruct a volumetric image from a single projection image by optimizing the PCA coefficients such that its computed projection matches the measured one. The 3D location of the tumor can be derived by applying the inverted DVF on its position in the reference image. Our algorithm was implemented on graphics processing units (GPUs) to achieve real-time efficiency. We generated the training data using a realistic and dynamic mathematical phantom with 10 breathing phases. The testing data were 360 cone beam projections corresponding to one gantry rotation, simulated using the same phantom with a 50% increase in breathing amplitude. Results: The average relative image intensity error of the reconstructed volumetric images is 6.9% +/- 2.4%. The average 3D tumor localization error is 0.8 mm +/- 0.5 mm. On an NVIDIA Tesla C1060 GPU card, the average computation time for reconstructing a volumetric image from each projection is 0.24 seconds (range: 0.17 and 0.35 seconds). Conclusions: We have shown the feasibility of reconstructing volumetric images and localizing tumor positions in 3D in near real-time from a single x-ray image.Comment: 8 pages, 3 figures, submitted to Medical Physics Lette

3D tumor localization through real-time volumetric x-ray imaging for lung cancer radiotherapy

Recently we have developed an algorithm for reconstructing volumetric images and extracting 3D tumor motion information from a single x-ray projection. We have demonstrated its feasibility using a digital respiratory phantom with regular breathing patterns. In this work, we present a detailed description and a comprehensive evaluation of the improved algorithm. The algorithm was improved by incorporating respiratory motion prediction. The accuracy and efficiency were then evaluated on 1) a digital respiratory phantom, 2) a physical respiratory phantom, and 3) five lung cancer patients. These evaluation cases include both regular and irregular breathing patterns that are different from the training dataset. For the digital respiratory phantom with regular and irregular breathing, the average 3D tumor localization error is less than 1 mm. On an NVIDIA Tesla C1060 GPU card, the average computation time for 3D tumor localization from each projection ranges between 0.19 and 0.26 seconds, for both regular and irregular breathing, which is about a 10% improvement over previously reported results. For the physical respiratory phantom, an average tumor localization error below 1 mm was achieved with an average computation time of 0.13 and 0.16 seconds on the same GPU card, for regular and irregular breathing, respectively. For the five lung cancer patients, the average tumor localization error is below 2 mm in both the axial and tangential directions. The average computation time on the same GPU card ranges between 0.26 and 0.34 seconds